On colored digraphs with exactly one nonsingular cycle
نویسندگان
چکیده
The class of connected 3-colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue of such a graph can be realized as the algebraic connectivity (second smallest Laplacian eigenvalue) of a suitable undirected graph. The nonsingular unicyclic 3-colored digraph on n vertices, which minimize the smallest Laplacian eigenvalue over all such graphs is determined in this article.
منابع مشابه
Ela on 3-colored Digraphs with Exactly One Nonsingular Cycle
The class of connected 3-colored digraphs containing exactly one nonsingular cycle is considered in this article. The main objective is to study the smallest Laplacian eigenvalue and the corresponding eigenvectors of such graphs. It is shown that the smallest Laplacian eigenvalue of such a graph can be realized as the algebraic connectivity (second smallest Laplacian eigenvalue) of a suitable u...
متن کاملNew Proofs of the Uniqueness of Noneven
A new graph-theoretic proof of the uniqueness of noneven digraphs G(n) on n vertices with the maximum number M(n) of arcs will be discussed. This proof is then shown to be easily modiied to prove the second uniqueness result , namely, for n > 4; there is exactly one equivalence class of maximal strongly-connected noneven digraphs G(T 1 (n)) on n vertices with M(n) ? 1 arcs. There are no maximal...
متن کاملOn signed digraphs with all cycles negative
It is known that signed graphs with all cycles negative are those in which each block is a negative cycle or a single line. We now study the more difficult problem for signed digraphs. In particular we investigate the structure of those digraphs whose arcs can be signed (positive or negative) so that every (directed) cycle is negative. Such digraphs are important because they are associated wit...
متن کاملThe Euler and Chinese Postman Problems on 2-Arc-Colored Digraphs
The famous Chinese Postman Problem (CPP) is polynomial time solvable on both undirected and directed graphs. Gutin et al. [Discrete Applied Math 217 (2016)] generalized these results by proving that CPP on c-edge-colored graphs is polynomial time solvable for every c ≥ 2. In CPP on weighted edge-colored graphs G, we wish to find a minimum weight properly colored closed walk containing all edges...
متن کاملK-colored Kernels
We study k-colored kernels in m-colored digraphs. An m-colored digraph D has k-colored kernel if there exists a subset K of its vertices such that (i) from every vertex v / ∈ K there exists an at most k-colored directed path from v to a vertex of K and (ii) for every u, v ∈ K there does not exist an at most k-colored directed path between them. In this paper, we prove that for every integer k ≥...
متن کامل